منابع مشابه
Expressible Semantics for Expressible Counterfactuals
Lewis (1981) showed the equivalence between two dominant semantic frameworks for counterfactuals: ordering semantics, which relies on orders between possible worlds, and premise semantics, which relies on sets of propositions (so-called ordering sources). I define a natural, restricted version of premise semantics, expressible premise semantics, which is based on ordering sources containing onl...
متن کاملOn Thin Sets of Primes Expressible as Sumsets
In this paper we will use the following notation. Given a set of positive integers S, we let S(x) denote the number of elements in S that are ≤ x, and we let |S| denote the total number of elements of S. Given two sets of positive integers A and B, we denote the sumset {a + b : a ∈ A, b ∈ B} by A + B; and so, the number of elements in A + B that are ≤ x will be (A + B)(x). For a finite set of i...
متن کاملExpressible Inspections
A decision maker needs predictions about the realization of a repeated experiment in each period. An expert provides a theory that, conditional on each finite history of outcomes, supplies a probabilistic prediction about the next outcome. However, there may be false experts without any knowledge of the data-generating process who deliver theories strategically. Hence, empirical tests for predi...
متن کاملFunctionally Expressible Multidistances
In this paper we deal with the problem of aggregating pairwise distance values in order to obtain a multi-argument distance function. After introducing the concept of functionally expressible multidistance, several essential types of multidimensional aggregation functions are considered to construct such kind of multidistances. An example of non functionally expressible multidistance is exhibited.
متن کاملOn an Algebraic Classification of Multidimensional Recursively Enumerable Sets Expressible in Formal Arithmetical Systems
Algebraic representations of multidimensional recursively enumerable sets which are expressible in formal arithmetical systems based on the signatures ) , , , 0 ( S , ) , , , 0 ( S , ) , , 0 ( S , where 1 ) ( x x S , are introduced and investigated. The equivalence is established between the algebraic and logical representations of multidimensional recursively enumerable sets expr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2009
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-009-0058-7